- Home
- Search Results
- Page 1 of 1
Search for: All records
-
Total Resources5
- Resource Type
-
0004000001000000
- More
- Availability
-
50
- Author / Contributor
- Filter by Author / Creator
-
-
Murtagh, Jack (5)
-
Sidford, Aaron (3)
-
Vadhan, Salil (3)
-
Reingold, Omer (2)
-
Ahmadinejad, AmirMahdi (1)
-
Bafna, Mitali (1)
-
Doron, Dean (1)
-
Kelner, Jonathan (1)
-
Peebles, John (1)
-
Vadhan, Salil P. (1)
-
Vyas, Nikhil. (1)
-
Zuckerman, David (1)
-
#Tyler Phillips, Kenneth E. (0)
-
#Willis, Ciara (0)
-
& Abreu-Ramos, E. D. (0)
-
& Abramson, C. I. (0)
-
& Abreu-Ramos, E. D. (0)
-
& Adams, S.G. (0)
-
& Ahmed, K. (0)
-
& Ahmed, Khadija. (0)
-
- Filter by Editor
-
-
null (2)
-
& Spizer, S. M. (0)
-
& . Spizer, S. (0)
-
& Ahn, J. (0)
-
& Bateiha, S. (0)
-
& Bosch, N. (0)
-
& Brennan K. (0)
-
& Brennan, K. (0)
-
& Chen, B. (0)
-
& Chen, Bodong (0)
-
& Drown, S. (0)
-
& Ferretti, F. (0)
-
& Higgins, A. (0)
-
& J. Peters (0)
-
& Kali, Y. (0)
-
& Ruiz-Arias, P.M. (0)
-
& S. Spitzer (0)
-
& Sahin. I. (0)
-
& Spitzer, S. (0)
-
& Spitzer, S.M. (0)
-
-
Have feedback or suggestions for a way to improve these results?
!
Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher.
Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?
Some links on this page may take you to non-federal websites. Their policies may differ from this site.
-
Murtagh, Jack; Reingold, Omer; Sidford, Aaron; Vadhan, Salil P. (, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques)
-
Ahmadinejad, AmirMahdi; Kelner, Jonathan; Murtagh, Jack; Peebles, John; Sidford, Aaron; Vadhan, Salil (, 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS))null (Ed.)
-
Doron, Dean; Murtagh, Jack; Vadhan, Salil; Zuckerman, David (, 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020))null (Ed.)
-
Bafna, Mitali; Murtagh, Jack; Vyas, Nikhil. (, Advances in neural information processing systems)We give a new algorithm for approximating the Discrete Fourier transform of an approximately sparse signal that has been corrupted by worst-case L0 noise, namely a bounded number of coordinates of the signal have been corrupted arbitrarily. Our techniques generalize to a wide range of linear transformations that are used in data analysis such as the Discrete Cosine and Sine transforms, the Hadamard transform, and their high-dimensional analogs. We use our algorithm to successfully defend against well known L0 adversaries in the setting of image classification. We give experimental results on the Jacobian-based Saliency Map Attack (JSMA) and the Carlini Wagner (CW) L0 attack on the MNIST and Fashion-MNIST datasets as well as the Adversarial Patch on the ImageNet dataset.more » « less
An official website of the United States government

Full Text Available